-
1 chromatic decomposition
Большой англо-русский и русско-английский словарь > chromatic decomposition
-
2 chromatic decomposition
Математика: хроматическое разложениеУниверсальный англо-русский словарь > chromatic decomposition
-
3 chromatic decomposition
т. граф.English-Russian scientific dictionary > chromatic decomposition
-
4 decomposition
1) декомпозиция; разбиение; разложение2) распад; разложение3) расщепление4) геол. химическое выветривание• -
5 хроматическое разложение
Большой англо-русский и русско-английский словарь > хроматическое разложение
-
6 number
1) число || числовой2) номер || нумеровать3) код числа4) количество5) колонцифра6) численность || считать, подсчитывать, исчислять8) числительное•a great number of — множество, большое количество
a number of — (целый) ряд, некоторое количество
- absolutely pseudoprime number - connectivity number - deficient number - edge attachment number - edge covering number - edge sensitivity number - expected sample number - general recursively irrational number - geodesic crossing number - integer number - integral number - internal stability number - international customer number - mass exchange number - mixed-radix number - Mohs hardness number - number of principal cotype - number of space dimensions - octonary number - one-digit number - one-figure number - one's complement number - rectilinear crossing number - recursively real number - serial number - Shore hardness number - strictly positive number - vertex covering numberwinding number of a curve with respect to the point — порядок кривой относительно точки (число оборотов вектора, соединяющего данную точку с точкой кривой при обходе кривой)
См. также в других словарях:
Optical aberration — v · d · e Optical aberration … Wikipedia
Degeneracy (graph theory) — In graph theory, a k degenerate graph is an undirected graph in which every subgraph has a vertex of degree at most k: that is, some vertex in the subgraph touches k or fewer of the subgraph s edges. The degeneracy of a graph is the smallest… … Wikipedia
Neighbourhood (graph theory) — A graph consisting of 6 vertices and 7 edges For other meanings of neighbourhoods in mathematics, see Neighbourhood (mathematics). For non mathematical neighbourhoods, see Neighbourhood (disambiguation). In graph theory, an adjacent vertex of a… … Wikipedia
Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… … Wikipedia
Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… … Wikipedia
Matroid — In combinatorics, a branch of mathematics, a matroid ( /ˈmeɪ … Wikipedia
Circle graph — For the chart, see Pie chart. A circle with five chords and the corresponding circle graph. In graph theory, a circle graph is the intersection graph of a set of chords of a circle. That is, it is an undirected graph whose vertices can be… … Wikipedia
Tritone — For other uses, see Tritone (disambiguation). tritone Inverse tritone Name Other names augmented fourth, diminished fifth Abbreviation TT Size … Wikipedia
Critical graph — In general the notion of criticality can refer to any measure. But in graph theory, when the term is used without any qualification, it almost always refers to the chromatic number of a graph. Critical graphs are interesting because they are the… … Wikipedia
photography, technology of — Introduction equipment, techniques, and processes used in the production of photographs. The most widely used photographic process is the black and white negative–positive system (Figure 1 >). In the camera the lens projects an image of… … Universalium
Star (graph theory) — Star The star S7. (Some authors index this as S8.) Vertices k+1 Edges k … Wikipedia
